package alg20241102;

public class Text {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        if(nums[right] < target) return nums.length;
        while(left < right){
            int mid = left + (right - left) / 2;
            if(nums[mid] < target){
                left = mid + 1;
            }else{
                right = mid;
            }
        }
        return left;
    }
}
